- it suffices to prove that
- Математика: достаточно только доказать (...)
Универсальный англо-русский словарь. Академик.ру. 2011.
Универсальный англо-русский словарь. Академик.ру. 2011.
The Church — The Church † Catholic Encyclopedia ► The Church The term church (Anglo Saxon, cirice, circe; Modern German, Kirche; Sw., Kyrka) is the name employed in the Teutonic languages to render the Greek ekklesia (ecclesia), the term by which… … Catholic encyclopedia
Jet (mathematics) — In mathematics, the jet is an operation which takes a differentiable function f and produces a polynomial, the truncated Taylor polynomial of f , at each point of its domain. Although this is the definition of a jet, the theory of jets regards… … Wikipedia
Axiom of countable choice — The axiom of countable choice or axiom of denumerable choice, denoted ACω, is an axiom of set theory, similar to the axiom of choice. It states that any countable collection of non empty sets must have a choice function. Spelled out, this means… … Wikipedia
Proofs of Fermat's little theorem — This article collects together a variety of proofs of Fermat s little theorem, which states that:a^p equiv a pmod p ,!for every prime number p and every integer a (see modular arithmetic). Simplifications Some of the proofs of Fermat s little… … Wikipedia
Backjumping — In backtracking algorithms, backjumping is a technique that reduces search space, therefore increasing efficiency. While backtracking always goes up one level in the search tree when all values for a variable have been tested, backjumping may go… … Wikipedia
Lebesgue integration — In mathematics, the integral of a non negative function can be regarded in the simplest case as the area between the graph of that function and the x axis. Lebesgue integration is a mathematical construction that extends the integral to a larger… … Wikipedia
Monotone convergence theorem — In mathematics, there are several theorems dubbed monotone convergence; here we present some major examples. Contents 1 Convergence of a monotone sequence of real numbers 1.1 Theorem 1.2 Proof 1.3 … Wikipedia
Kolmogorov complexity — In algorithmic information theory (a subfield of computer science), the Kolmogorov complexity of an object, such as a piece of text, is a measure of the computational resources needed to specify the object. It is named after Soviet Russian… … Wikipedia
Sequent calculus — In proof theory and mathematical logic, sequent calculus is a family of formal systems sharing a certain style of inference and certain formal properties. The first sequent calculi, systems LK and LJ, were introduced by Gerhard Gentzen in 1934 as … Wikipedia
Ping-pong lemma — In mathematics, the ping pong lemma, or table tennis lemma, is any of several mathematical statements which ensure that several elements in a group acting on a set freely generate a free subgroup of that group.HistoryThe ping pong argument goes… … Wikipedia
Burnside theorem — In mathematics, Burnside s theorem in group theory states that if G is a finite group of order :p^a q^b where p and q are prime numbers, and a and b are non negative integers, then G is solvable. Hence eachnon Abelian finite simple group has… … Wikipedia